Simultaneous single-step one-shot optimization with unsteady PDEs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous single-step one-shot optimization with unsteady PDEs

The single-step one-shot method has proven to be very efficient for PDEconstrained optimization where the partial differential equation (PDE) is solved by an iterative fixed point solver. In this approach, the simulation and optimization tasks are performed simultaneously in a single iteration. If the PDE is unsteady, finding an appropriate fixed point iteration is nontrivial. In this paper, we...

متن کامل

A ONE SHOT APPROACH TO TOPOLOGY OPTIMIZATION WITH LOCAL STRESS CONSTRAINTS One shot approach to topology optimization

We consider the topology optimization problem with local stress constraints. In the basic formulation we have a pde-constrained optimization problem, where the finite element and design analysis are solved simultaneously. Here we introduce a new relaxation scheme based on a phase-field method. The starting point of this relaxation is a reformulation of the constraints of the optimization proble...

متن کامل

Accelerating solutions of one-dimensional unsteady PDEs with GPU-based swept time-space decomposition

The expedient design of precision components in aerospace and other high-tech industries requires simulations of physical phenomena often described by partial differential equations (PDEs) without exact solutions. Modern design problems require simulations with a level of resolution difficult to achieve in reasonable amounts of time—even in effectively parallelized solvers. Though the scale of ...

متن کامل

Symbolic Solutions of Simultaneous First-order PDEs in One Unknown

We propose and implement an algorithm for solving an overdetermined system of partial differential equations in one unknown. Our approach relies on Bour-Mayer method to determine compatibility conditions via Jacobi-Mayer brackets. We solve compatible systems recursively by imitating what one would do with pen and paper: Solve one equation, substitute the solution into the remaining equations an...

متن کامل

Self-Confirming Price Prediction Strategies for Simultaneous One-Shot Auctions

Bidding in simultaneous auctions is challenging because an agent’s value for a good in one auction may depend on the outcome of other auctions; that is, bidders face an exposure problem. Given the gap in our understanding (e.g., lack of game-theoretic solutions) of general simultaneous auction games, previous works have tackled the problem of how to bid in these games with heuristic strategies ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2016

ISSN: 0377-0427

DOI: 10.1016/j.cam.2015.07.033